Structural Results for Two-connected Networks with Rings of Bounded Cardinality
نویسنده
چکیده
We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, Labb e and Maaoli 6]. Structural results for this particular case are presented : we compute a lower bound on the number of edges in a feasible solution, we show that the problem is strongly NP-complete for any xed K, and we derive new classes of facet deening inequalities.
منابع مشابه
Two-Connected Networks with Rings of Bounded Cardinality
We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, Labbé and Maffioli [6]. In this paper, we compute a lower bound on the number of edges in a feasible solution, we show that the problem is strongly NP-...
متن کاملA note on the socle of certain types of f-rings
For any reduced commutative $f$-ring with identity and bounded inversion, we show that a condition which is obviously necessary for the socle of the ring to coincide with the socle of its bounded part, is actually also sufficient. The condition is that every minimal ideal of the ring consist entirely of bounded elements. It is not too stringent, and is satisfied, for instance, by rings of ...
متن کاملMathematical Programming Manuscript No
Facets for the polyhedron of two-connected networks with bounded rings Abstract. We study the polyhedron associated with a network design problem which consists in determining at minimum cost a two-connected network such that the shortest cycle to which each edge belongs (a \ring") does not exceed a given length K. We present here a new formulation of the problem and derive facet results for di...
متن کاملA tabu search heuristic for the design of two-connected networks with bounded rings
We present a tabu search heuristic for a network design problem which consists in determining at minimum cost a two-connected network such that the shortest cycle to which each edge belongs (a “ring”) does not exceed a given length K. Numerical results are provided for randomly generated graphs and graphs coming from real-world applications.
متن کاملLocally finite profinite rings
We investigate the structure of locally finite profinite rings. We classify (Jacobson-) semisimple locally finite profinite rings as products of complete matrix rings of bounded cardinality over finite fields, and we prove that the Jacobson radical of any locally finite profinite ring is nil of finite nilexponent. Our results apply to the context of small compact G-rings, where we also obtain a...
متن کامل